Secure message transmission and its applications

In this thesis we focus on various aspects of secure message transmission protocols. Such protocols achieve the secure transmission of a message from a sender to a receiver - where the term “secure” encapsulates the notion of privacy and reliability of message transmission. These two parties are connected using an underlying network in which a static computationally unlimited active adversary able to corrupt up to t network nodes is assumed to be present. Such protocols are important to study as they are used extensively in various cryptographic protocols and are of interest to other research areas such as ad-hoc networks, military networks amongst others. Optimal bounds for the number of phases (communication from sender to receiver or vice versa), connectivity requirements (number of node disjoint network paths connecting sender and receiver - denoted by n), communication complexity (complexity of the number of field elements sent - where F is the finite field used and jFj = q) and transmission complexity (proportion of communication complexity to complexity of secrets transmitted) for secure message transmission protocols have been proven in previous work. In the one-phase model it has been shown that n 3t+1 node disjoint paths are required to achieve perfect communication. In the two phase model only n 2t + 1 node disjoint paths are necessary. This connectivity is also the required bound for almost perfectly secure one-phase protocols - protocols which achieve perfect privacy but with a negligible probability may fail to achieve reliability. In such cases the receiver accepts a different message to that transmitted by the sender or does not accept any message. The main focus of recent research in secure message transmission protocols has been to present new protocols which achieve optimal transmission complexity. This has been achieved through the transmission of multiple messages. If a protocol has a communication complexity of O(n3) field elements, to achieve optimal transmission complexity O(n2) secrets will have to be communicated. This has somewhat ignored the simplification and improvement of protocols which securely transmit a single secret. Such improvements include constructing more efficient protocols with regards to communication complexity, computational complexity and the number of field elements sent throughout the whole protocol. In the thesis we first consider one-phase almost perfectly secure message transmission and present two new protocols which improve on previous work. We present a polynomial time protocol of O(n2) communication complexity which at the time of writing this thesis, is computationally more efficient than any other protocol of similar communication complexity for the almost perfectly secure transmission of a single message. Even though our first almost perfectly secure transmission protocol is of polynomial time, it is important to study other protocols also and improve previous work presented by other researchers. This is the idea behind the second one-phase almost perfectly secure message transmission protocol we present which requires an exponential complexity of field operations but lower (O(n)) communication complexity. This protocol also improves on previous protocols of similar communication complexity, requiring in the order of O(log q) less computation to complete - where q denotes the size of the finite field used. Even though this protocol is of exponential time, for small values of n (e.g. when t = 1, t = 2 or t = 3) it may be beneficial to use this protocol for almost perfectly secure communication as opposed to using the polynomial time protocol. This is because less field elements need to be transmitted over the whole network which connects a sender and a receiver. Furthermore, an optimal almost perfectly secure transmission protocol will be one with O(n) communication complexity and with polynomial computational complexity. We hope that in the future, other researchers will be inspired by our proposed protocol, improve on our work and ideally achieve these optimal results. We also consider multi-phase protocols. By combining various cryptographic schemes, we present a new two-phase perfectly secure single message transmission protocol. At the time of writing this thesis, the protocol is the most efficient protocol when considering communication complexity. Our protocol has a communication complexity of O(n2) compared to O(n3) of previous work thus improving on the communication complexity by an order of O(n) for the perfectly secure message transmission of a single message. This protocol is then extended to a three phase protocol where a multi-recipient broadcast end channel network setting is considered. As opposed to point to point networks where a path from a sender reaches a single receiver, this network model is new in the field of message transmission protocols. In this model each path from a sender reaches multiple receivers, with all receivers receiving the same information from their common network communication channel. We show how the use of this protocol upon such a network can lead to great savings in the transmission and computation carried out by a single sender. We also discuss the importance and relevance of such a multi-recipient setting to practical applications. The first protocols in the field of perfectly secure message transmission with a human receiver are also presented. This is a topic proposed by my supervisor Professor Yvo Desmedt for which I constructed solutions. In such protocols, one of the communicating parties is considered to be a human who does not have access to a computational device. Because of this, solutions for such protocols need to be computationally efficient and computationally simple so that they can be executed by the human party. Experiments with human participants were carried out to assess how easily and accurately human parties used the proposed protocols. The experimental results are presented and these identify how well human participants used the protocols. In addition to the security of messages, we also consider how one can achieve anonymity of message transmission protocols. For such protocols, considering a single-receiver multi-sender scenario, the presence of a t-threshold bounded adversary and the transmission of multiple secrets (as many as the number of sender), once the protocols ends one should not be able to identify the sender of a received message. Considering a passive and active adversary new protocols are presented which achieve the secure and anonymous transmission of messages in the information-theoretic security model. Our proposed solutions can also be applied (with minor alterations) to the dual problem when a single-sender multi-recipient communication setting is considered. The contributions of the thesis are primarily theoretical - thus no implementation of the proposed protocols was carried out. Despite this, we reflect on practical aspects of secure message transmission protocols. We review the feasibility of implementing secure message transmission protocols in general upon various networks - focusing on the Internet which can be considered as the most important communication network at this time. We also describe in theory how concepts of secure message transmission protocols could possibly be used in practical implementations for secure communication on various existing communication networks. Open problems that remain unsolved in the research area of the proposed protocols are also discussed and we hope that these inspire research and future solutions for the design (and implementation) of better and more efficient secure message transmission protocols

Making Code Voting Secure against Insider Threats using Unconditionally Secure MIX Schemes and Human PSMT Protocols

Code voting was introduced by Chaum as a solution for using a possibly infected-by-malware device to cast a vote in an electronic voting application. Chaum's work on code voting assumed voting codes are physically delivered to voters using the mail system, implicitly requiring to trust the mail system. This is not necessarily a valid assumption to make - especially if the mail system cannot be trusted. When conspiring with the recipient of the cast ballots, privacy is broken. It is clear to the public that when it comes to privacy, computers and "secure" communication over the Internet cannot fully be trusted. This emphasizes the importance of using: (1) Unconditional security for secure network communication. (2) Reduce reliance on untrusted computers. In this paper we explore how to remove the mail system trust assumption in code voting. We use PSMT protocols (SCN 2012) where with the help of visual aids, humans can carry out $\mod 10$ addition correctly with a 99\% degree of accuracy. We introduce an unconditionally secure MIX based on the combinatorics of set systems. Given that end users of our proposed voting scheme construction are humans we \emph{cannot use} classical Secure Multi Party Computation protocols. Our solutions are for both single and multi-seat elections achieving: \begin{enumerate}[i)] \item An anonymous and perfectly secure communication network secure against a $t$-bounded passive adversary used to deliver voting, \item The end step of the protocol can be handled by a human to evade the threat of malware. \end{enumerate} We do not focus on active adversaries

Hormonal response to lipid and carbohydrate meals during the acute postprandial period

<p>Abstract</p> <p>Background</p> <p>Optimizing the hormonal environment during the postprandial period in favor of increased anabolism is of interest to many active individuals. Data are conflicting regarding the acute hormonal response to high fat and high carbohydrate feedings. Moreover, to our knowledge, no studies have compared the acute hormonal response to ingestion of lipid and carbohydrate meals of different size.</p> <p>Methods</p> <p>We compared the hormonal response to lipid and carbohydrate meals of different caloric content during the acute postprandial period. Nine healthy men (22 ± 2 years) consumed in a random order, cross-over design one of four meals/beverages during the morning hours in a rested and fasted state: dextrose at 75 g (300 kcals), dextrose at 150 g (600 kcals), lipid at 33 g (300 kcals), lipid at 66 g (600 kcals). Blood samples were collected Pre meal, and at 0.5 hr, 1 hr, 2 hr, and 3 hr post meal. Samples were assayed for testosterone, cortisol, and insulin using ELISA techniques. Area under the curve (AUC) was calculated for each variable, and a 4 × 5 ANOVA was used to further analyze data.</p> <p>Results</p> <p>A meal × time effect (p = 0.0003) was noted for insulin, with values highest for the dextrose meals at the 0.5 hr and 1 hr times, and relatively unaffected by the lipid meals. No interaction (p = 0.98) or meal (p = 0.39) effect was noted for testosterone, nor was an interaction (p = 0.99) or meal (p = 0.65) effect noted for cortisol. However, a time effect was noted for both testosterone (p = 0.04) and cortisol (p < 0.0001), with values decreasing during the postprandial period. An AUC effect was noted for insulin (p = 0.001), with values higher for the dextrose meals compared to the lipid meals (p < 0.05). No AUC effect was noted for testosterone (p = 0.85) or cortisol (p = 0.84).</p> <p>Conclusions</p> <p>These data indicate that 1) little difference is noted in serum testosterone or cortisol during the acute postprandial period when healthy men consume lipid and dextrose meals of different size; 2) Both testosterone and cortisol experience a drop during the acute postprandial period, which is similar to what is expected based on the normal diurnal variation--feeding with lipid or dextrose meals does not appear to alter this pattern; 3) dextrose meals of either 75 g or 150 g result in a significant increase in serum insulin, in particular at 0.5 hr and 1 hr post-ingestion; 4) lipid meals have little impact on serum insulin.</p

Netnography of Female Use of the Synthetic Growth Hormone CJC-1295: Pulses and Potions

Background. Communal online folk pharmacology fuels the drive for short cuts in attaining muscle enhancement, fat loss, and youthful skin. Objectives. The study used “netnography” to explore female use of CJC-1295, a synthetic growth hormone analogue from the perspectives contained in Internet forum activity. Methods. A systematic Internet search was conducted using variation of the term “CJC-1295”; and combined with “forum.” Ninety-six hits related to bodybuilding websites where CJC-1295 was mentioned. Following application of exclusion criteria to confine to female use and evidence of forum activity, 9 sites remained. These were searched internally for reference to CJC-1295. Twenty-three discussion threads relating to female use of CJC-1295 formed the end data set, and analyzed using the Empirical Phenomenological Psychological method. Results. Forum users appeared well versed and experienced in the poly use of performance and image drug supplementation. Choice to use CJC-1295 centered on weight loss, muscle enhancement, youthful skin, improved sleep, and injury healing. Concerns were described relating to female consequences of use given gender variations in growth hormone pulses affecting estimation of dosage, cycling, and long-term consequences. Conclusions. Public health interventions should consider female self-medicating use of synthetic growth hormone within a repertoire of product supplementation, and related adverse health consequences

Growth hormone doping: a review

Ioulietta Erotokritou-Mulligan, Richard IG Holt, Peter H S&amp;ouml;nksenDevelopmental Origins of Health and Disease Division, University of Southampton School of Medicine, The Institute of Developmental Science, Southampton General Hospital, Southampton, UKAbstract: The use of growth hormone (GH) as a performance enhancing substance was first promoted in lay publications, long before scientists fully acknowledged its benefits. It is thought athletes currently use GH to enhance their athletic performance and to accelerate the healing of sporting injuries. Over recent years, a number of high profile athletes have admitted to using GH. To date, there is only limited and weak evidence for its beneficial effects on performance. Nevertheless the &amp;ldquo;hype&amp;rdquo; around its effectiveness and the lack of a foolproof detection methodology that will detect its abuse longer than 24 hours after the last injection has encouraged its widespread use. This article reviews the current evidence of the ergogenic effects of GH along with the risks associated with its use. The review also examines methodologies, both currently available and in development for detecting its abuse.Keywords: performance enhancing substance, GH, doping in sport, detection method

Generation and characterization of two-photon entanglement in the mid-infrared

We demonstrate two-photon interference and polarization entanglement at 2090 nm, constituting a crucial leap towards free-space mid-infrared quantum communication systems in a spectral region with high atmospheric transparency and reduced solar background

Two-photon quantum interference and entanglement at 2.1 mu m

Quantum-enhanced optical systems operating within the 2- to 2.5-mu m spectral region have the potential to revolutionize emerging applications in communications, sensing, and metrology. However, to date, sources of entangled photons have been realized mainly in the near-infrared 700- to 1550- nm spectral window. Here, using custom-designed lithium niobate crystals for spontaneous parametric down-conversion and tailored superconducting nanowire single-photon detectors, we demonstrate two-photon interference and polarization-entangled photon pairs at 2090 nm. These results open the 2- to 2.5-mu m mid-infrared window for the development of optical quantum technologies such as quantum key distribution in next-generation mid-infrared fiber communication systems and future Earth-to-satellite communications

Waveguide Integrated Superconducting Nanowire Single Photon Detectors for Quantum Photonic Applications

No abstract available